Algebraic models for two-edge-connected graphs
نویسندگان
چکیده
منابع مشابه
Sufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملCorrelation Clustering and Two-edge-connected Augmentation for Planar Graphs
In correlation clustering, the input is a graph with edge-weights, where every edge is labelled either + or − according to similarity of its endpoints. The goal is to produce a partition of the vertices that disagrees with the edge labels as little as possible. In two-edge-connected augmentation, the input is a graph with edge-weights and a subset R of edges of the graph. The goal is to produce...
متن کاملGenerating connected and 2-edge connected graphs
We focus on the algorithm underlying the main result of [6]. This is an algebraic formula to generate all connected graphs in a recursive and efficient manner. The key feature is that each graph carries a scalar factor given by the inverse of the order of its group of automorphisms. In the present paper, we revise that algorithm on the level of graphs. Moreover, we extend the result subsequentl...
متن کاملmaximally edge - connected and super - edge - connected graphs ∗
Let G be a connected graph with minimum degree δ and edgeconnectivity λ. A graph is maximally edge-connected if λ = δ, and it is superedge-connected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree. In this paper, we show that a connected graph or a connected triangle-free graph is maximally edge-connected or sup...
متن کامل2-connected and 2-edge-connected Steinhaus graphs
The numbers of 2-connected and 2-edge-connected Steinhaus graphs with n vertices are determined for n¿ 6. The possible generating strings of 2-connected and 2-edge-connected Steinhaus graphs are classi0ed. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1976
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90080-7